Algorithms for regular languages that use algebra
نویسندگان
چکیده
منابع مشابه
TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملRandomized sliding window algorithms for regular languages
A sliding window algorithm receives a stream of symbols and has to output at each time instant a certain value which only depends on the last $n$ symbols. If the algorithm is randomized, then at each time instant it produces an incorrect output with probability at most $\epsilon$, which is a constant error bound. This work proposes a more relaxed definition of correctness which is parameterized...
متن کاملAlgorithms for Learning Function Distinguishable Regular Languages
Function distinguishable languages were introduced as a new methodology of defining characterizable subclasses of the regular languages which are learnable from text. Here, we give details on the implementation and the analysis of the corresponding learning algorithms. We also discuss problems which might occur in practical applications.
متن کاملLogic Meets Algebra: the Case of Regular Languages
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according to their descriptive complexity, i.e. the type of logical formalism required to define them. The algebraic point of view on automata is an essential complement of this classification: by providing alternative, algebraic ...
متن کاملA Family of Algorithms for Non Deterministic Regular Languages Inference
We present in this paper a new family of algorithms for regular languages inference from complete presentation. Every algorithm of this family, on input of the sets of words (D+, D−), obtains for every x in D+ at least a non deterministic finite automaton (NFA) which accepts x and is consistent with D−. This automaton is, besides, irreducible in the sense that any further merging of states acce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMOD Record
سال: 2012
ISSN: 0163-5808
DOI: 10.1145/2350036.2350038